منابع مشابه
Clique counting in MapReduce: theory and experiments
We present exact and approximate MapReduce estimators for the number of cliques of size k in an undirected graph, for any small constant k ≥ 3. Besides theoretically analyzing our algorithms in the computational model for MapReduce introduced by Karloff, Suri, and Vassilvitskii, we present the results of extensive computational experiments on the Amazon EC2 platform. Our experiments show the pr...
متن کاملBrief Announcement: Semi-MapReduce Meets Congested Clique
Graph problems are troublesome when it comes to MapReduce. Typically, to be able to design algorithms that make use of the advantages of MapReduce, assumptions beyond what the model imposes, such as the density of the input graph, are required. In a recent shift, a simple and robust model of MapReduce for graph problems, where the space per machine is set to be O(|V |) has attracted considerabl...
متن کاملMapReduce vs. Pipelining Counting Triangles
In this paper we follow an alternative approach named pipeline, to implement a parallel implementation of the well-known problem of counting triangles in a graph. This problem is especially interesting either when the input graph does not fit in memory or is dynamically generated. To be concrete, we implement a dynamic pipeline of processes and an ad-hoc MapReduce version using the language Go....
متن کاملL 16 : Counting Triangles in MapReduce
These days, global pool of data is growing at 2.5 quintillion byte per day and more than 90 percent of this huge pool of data has been produced in the last two years alone [1]. The era of big data has arrived. After [2] explained the file system of Google in this way such that files are split in to various chunks stored in a redundant fashion on a cluster or commodity machines, most of research...
متن کاملCounting Triangles in Massive Graphs with MapReduce
Graphs and networks are used to model interactions in a variety of contexts. There is a growing need to quickly assess the characteristics of a graph in order to understand its underlying structure. Some of the most useful metrics are triangle-based and give a measure of the connectedness of mutual friends. This is often summarized in terms of clustering coefficients, which measure the likeliho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Journal of Experimental Algorithmics
سال: 2015
ISSN: 1084-6654,1084-6654
DOI: 10.1145/2794080